recursive formula

См. также в других словарях:

• Recursive partitioning — is a statistical method for multivariable analysis.cite book |author=Breiman, Leo |title=Classification and Regression Trees |publisher=Chapman Hall/CRC |location=Boca Raton |year=1984 |pages= |isbn=0 412 04841 8 |oclc= |doi=] . Recursive… …   Wikipedia

• recursive — [ri kʉr′siv] adj. 1. reapplying the same formula or algorithm to a number or result in order to generate the next number or result in a series 2. returning again and again to a point or points already made [a recursive style of writing] …   English World dictionary

• Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… …   Wikipedia

• Recursive definition — A recursive definition or inductive definition is one that defines something in terms of itself (that is, recursively), albeit in a useful way. For it to work, the definition in any given case must be well founded, avoiding an infinite regress.… …   Wikipedia

• recursive — A procedure that is applied once, and then applied to the result of that application, and so on. A recursive definition (definition by induction) defines the result of some operation for 0, and then the result for any number n + 1 in terms of the …   Philosophy dictionary

• recursive — adjective a) drawing upon itself, referring back. The recursive nature of stories which borrow from each other b) of an expression, each term of which is determined by applying a formula to preceding terms …   Wiktionary

• recursive function — ▪ mathematics       in logic and mathematics, a type of function or expression predicating some concept or property of one or more variables, which is specified by a procedure that yields values or instances of that function by repeatedly… …   Universalium

• Weyl character formula — In mathematics, the Weyl character formula in representation theory describes the characters of irreducible representations of compact Lie groups in terms of their highest weights. It is named after Hermann Weyl, who proved it in the late… …   Wikipedia

• True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… …   Wikipedia

• Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… …   Wikipedia

• Euler's formula — This article is about Euler s formula in complex analysis. For Euler s formula in algebraic topology and polyhedral combinatorics see Euler characteristic.   Part of a series of articles on The mathematical constant e …   Wikipedia